The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^3, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

p(0) → 0
p(s(x)) → x
plus(x, 0) → x
plus(0, y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0, y) → 0
times(s(0), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0, 0) → true
eq(s(x), 0) → false
eq(0, s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0)) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
plus, times, div, quot, eq, pr

They will be analysed ascendingly in the following order:
plus < times
times < div
div = quot

(6) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
plus, times, div, quot, eq, pr

They will be analysed ascendingly in the following order:
plus < times
times < div
div = quot

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)

Induction Base:
plus(gen_0':s3_0(a), gen_0':s3_0(0)) →_R^Ω(1)
gen_0':s3_0(a)

Induction Step:
plus(gen_0':s3_0(a), gen_0':s3_0(+(n5_0, 1))) →_R^Ω(1)
s(plus(gen_0':s3_0(a), p(s(gen_0':s3_0(n5_0))))) →_R^Ω(1)
s(plus(gen_0':s3_0(a), gen_0':s3_0(n5_0))) →_IH
s(gen_0':s3_0(+(a, c6_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
times, div, quot, eq, pr

They will be analysed ascendingly in the following order:
times < div
div = quot

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

Induction Base:
times(gen_0':s3_0(0), gen_0':s3_0(b)) →_R^Ω(1)
0'

Induction Step:
times(gen_0':s3_0(+(n1071_0, 1)), gen_0':s3_0(b)) →_R^Ω(1)
plus(gen_0':s3_0(b), times(gen_0':s3_0(n1071_0), gen_0':s3_0(b))) →_IH
plus(gen_0':s3_0(b), gen_0':s3_0(*(c1072_0, b))) →_L^{Ω(1 + b·n1071₀)}
gen_0':s3_0(+(*(n1071_0, b), b))

We have rt ∈ Ω(n³) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n³).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
eq, div, quot, pr

They will be analysed ascendingly in the following order:
div = quot

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)

Induction Base:
eq(gen_0':s3_0(0), gen_0':s3_0(0)) →_R^Ω(1)
true

Induction Step:
eq(gen_0':s3_0(+(n2426_0, 1)), gen_0':s3_0(+(n2426_0, 1))) →_R^Ω(1)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
pr, div, quot

They will be analysed ascendingly in the following order:
div = quot

(16) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol pr.

(17) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
quot, div

They will be analysed ascendingly in the following order:
div = quot

(18) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
quot(gen_0':s3_0(n3249_0), gen_0':s3_0(+(1, n3249_0)), gen_0':s3_0(c)) → gen_0':s3_0(0), rt ∈ Ω(1 + n3249₀)

Induction Base:
quot(gen_0':s3_0(0), gen_0':s3_0(+(1, 0)), gen_0':s3_0(c)) →_R^Ω(1)
0'

Induction Step:
quot(gen_0':s3_0(+(n3249_0, 1)), gen_0':s3_0(+(1, +(n3249_0, 1))), gen_0':s3_0(c)) →_R^Ω(1)
quot(gen_0':s3_0(n3249_0), gen_0':s3_0(+(1, n3249_0)), gen_0':s3_0(c)) →_IH
gen_0':s3_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(19) Complex Obligation (BEST)

(20) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)
quot(gen_0':s3_0(n3249_0), gen_0':s3_0(+(1, n3249_0)), gen_0':s3_0(c)) → gen_0':s3_0(0), rt ∈ Ω(1 + n3249₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
div

They will be analysed ascendingly in the following order:
div = quot

(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol div.

(22) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)
quot(gen_0':s3_0(n3249_0), gen_0':s3_0(+(1, n3249_0)), gen_0':s3_0(c)) → gen_0':s3_0(0), rt ∈ Ω(1 + n3249₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

(24) BOUNDS(n^3, INF)

(25) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)
quot(gen_0':s3_0(n3249_0), gen_0':s3_0(+(1, n3249_0)), gen_0':s3_0(c)) → gen_0':s3_0(0), rt ∈ Ω(1 + n3249₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(26) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

(27) BOUNDS(n^3, INF)

(28) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)
eq(gen_0':s3_0(n2426_0), gen_0':s3_0(n2426_0)) → true, rt ∈ Ω(1 + n2426₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

(30) BOUNDS(n^3, INF)

(31) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(32) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
times(gen_0':s3_0(n1071_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n1071_0, b)), rt ∈ Ω(1 + b·n1071₀² + n1071₀)

(33) BOUNDS(n^3, INF)

(34) Obligation:

Innermost TRS:
Rules:
p(0') → 0'
p(s(x)) → x
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(s(x), y) → s(plus(p(s(x)), y))
plus(x, s(y)) → s(plus(x, p(s(y))))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))
eq(0', 0') → true
eq(s(x), 0') → false
eq(0', s(y)) → false
eq(s(x), s(y)) → eq(x, y)
divides(y, x) → eq(x, times(div(x, y), y))
prime(s(s(x))) → pr(s(s(x)), s(x))
pr(x, s(0')) → true
pr(x, s(s(y))) → if(divides(s(s(y)), x), x, s(y))
if(true, x, y) → false
if(false, x, y) → pr(x, y)

Types:
p :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
eq :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
divides :: 0':s → 0':s → true:false
prime :: 0':s → true:false
pr :: 0':s → 0':s → true:false
if :: true:false → 0':s → 0':s → true:false
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(35) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(a), gen_0':s3_0(n5_0)) → gen_0':s3_0(+(n5_0, a)), rt ∈ Ω(1 + n5₀)

(36) BOUNDS(n^1, INF)